A column generation heuristic for local drayage routing given a port access appointment system

نویسندگان

  • Rajeev Namboothiri
  • Alan L. Erera
چکیده

This paper studies methods for managing a fleet of trucks providing container pickup and delivery service (drayage) to a port with an appointment-based access control system. Responding to growing access congestion and its resultant impacts, many U.S. port terminals have implemented appointment systems, but little is known about the impact of such systems on drayage fleet efficiency. To address this knowledge gap, we develop a drayage operations optimization approach based on a column generation integer programming heuristic that explicitly models a time-slot port access control system. The approach determines pickup and delivery sequences with minimum transportation cost. We use the framework to develop an understanding of the potential efficiency impacts of access appointment systems on drayage operations, and find that the fleet size required to complete a set of drayage tasks can be quite sensitive to small changes in time-slot access capacities at the port.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Planning local container drayage operations given a port access appointment system

This paper studies the management of a fleet of trucks providing container pickup and delivery service (drayage) to a port with an appointment-based access control system. Responding to growing access congestion and its resultant impacts, many U.S. port terminals have implemented appointment systems, but little is known about the potential impact of such systems on drayage fleet efficiency. To ...

متن کامل

Multi-resource routing with flexible tasks: an application in drayage operations

This paper introduces an application of a Multi-Resource Routing Problem (MRRP) in drayage operations. Drayage involves the movement of loaded and empty equipment between rail yards, shippers, consignees and equipment yards. The problem of routing and scheduling drayage movements is modeled as an MRRP with flexible tasks, since the origins and destinations of some movements can be chosen from a...

متن کامل

A set-covering formulation for a drayage problem with single and double container loads

This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality b...

متن کامل

Heuristic column generation for the truck and trailer routing problem ⋆

We present a heuristic column generation for the truck and trailer routing problem (TTRP) in which the routes of the local optima of a GRASP/VNS are used as columns of a set-partitioning formulation of the TTRP. This approach outperforms the previous state-of-the-art methods and improves the best-known solutions for several test instances from the literature.

متن کامل

A Two-Phase Hybrid Heuristic Method for a Multi-Depot Inventory-Routing Problem

In this study, a two phase hybrid heuristic approach was proposed to solve the multi-depot multi-vehicle inventory routing problem (MDMVIRP). Inventory routing problem (IRP) is one of the major issues in the supply chain networks that arise in the context of vendor managed systems (VMI) The MDMVIRP combines inventory management and routing decision. We are given on input a fleet of homogeneous ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005